Developing a heuristic algorithm for order production planning using network models under uncertainty conditions

نویسندگان

  • H. Khademi Zare
  • Seyyed M. T. Fatemi Ghomi
  • Behrooz Karimi
چکیده

In this paper, a practical and appropriate algorithm is provided for order production planning under uncertainty conditions. Producing the order production projects using different methodologies is facing uncertainty and therefore specific techniques are required to determine their production planning schedule. Network models combining fuzzy logic to define the sequence of the production stages and uncertainty are appropriate tools for order production planning modeling. In this paper, start time parameters of each activity, duration of each activity and number of loops in the products production network are defined as triangular fuzzy numbers (pessimistic, possible, optimistic) and results of the production planning are defined as fuzzy sets. In this paper, network calculations including fuzzy forward CPM are performed. Output of this algorithm is a fuzzy order production schedule. This method is more practical than existing production planning schedules determination methods and has less calculation and has upgrade and mechanization capability. 2006 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing decentralized production–distribution planning problem in a multi-period supply chain network under uncertainty

Decentralized supply chain management is found to be significantly relevant in today’s competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final produc...

متن کامل

A multi-objective evolutionary approach for integrated production-distribution planning problem in a supply chain network

Integrated production-distribution planning (PDP) is one of the most important approaches in supply chain networks. We consider a supply chain network (SCN) to consist of multi suppliers, plants, distribution centers (DCs), and retailers. A bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

متن کامل

Two-stage Stochastic Programing Based on the Accelerated Benders Decomposition for Designing Power Network Design under Uncertainty

In this paper, a comprehensive mathematical model for designing an electric power supply chain network via considering preventive maintenance under risk of network failures is proposed. The risk of capacity disruption of the distribution network is handled via using a two-stage stochastic programming as a framework for modeling the optimization problem. An applied method of planning for the net...

متن کامل

ACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem

The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...

متن کامل

A Comprehensive Study of Several Meta-Heuristic Algorithms for Open-Pit Mine Production Scheduling Problem Considering Grade Uncertainty

It is significant to discover a global optimization in the problems dealing with large dimensional scales to increase the quality of decision-making in the mining operation. It has been broadly confirmed that the long-term production scheduling (LTPS) problem performs a main role in mining projects to develop the performance regarding the obtainability of constraints, while maximizing the whole...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 182  شماره 

صفحات  -

تاریخ انتشار 2006